Two-Stage Pursuit Strategy for Incomplete-Information Impulsive Space Pursuit-Evasion Mission Using Reinforcement Learning

Pursuit-Evasion Games with incomplete information in discrete time

Pursuit-Evasion Games (in discrete time) are stochastic games with nonnegative daily payoffs, with the final payoff being the cumulative sum of payoffs during the game. We show that such games admit a value even in the presence of incomplete information and that this value is uniform, i.e. there are ǫ-optimal strategies for both players that are ǫ-optimal in any long enough prefix of the game. ...

Hierarchical Strategy Synthesis for Pursuit-Evasion Problems

We present a novel approach for solving pursuit-evasion problems where multiple pursuers with limited sensing capabilities are used to detect all possible mobile evaders in a given environment. We make no assumptions about the number, the speed, or the maneuverability of evaders. Our algorithm takes as input a map of the environment and sensor models for the pursuers. We then obtain a graph rep...

Pursuit - Evasion Using Beam

Complete Information Pursuit Evasion in Polygonal Environments

Suppose an unpredictable evader is free to move around in a polygonal environment of arbitrary complexity that is under full camera surveillance. How many pursuers, each with the same maximum speed as the evader, are necessary and sufficient to guarantee a successful capture of the evader? The pursuers always know the evader’s current position through the camera network, but need to physically ...

A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment

We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader e is chased by pursuers p1, p2, . . . , p`. The players have full information about the environment and the location of the other players. The pursuers are allowed to coordinate their actions. On the pursuer turn, each pi can move to any point at distance at most 1 from his current l...